home *** CD-ROM | disk | FTP | other *** search
- #include "cpp_entry.h"
- #include "LinkedList.h"
- #include "HashTable.h"
- #include <iostream.h>
- #include "String.h"
- #include <stdlib.h>
-
- #define BLK_SIZE 500
-
- int block[2 * BLK_SIZE] ;
- int sec_block[2 *BLK_SIZE] ;
-
- void main (int argc, char **argv)
- {
- cerr << "Entered main " << endl ;
-
- int *temp ;
- LinkedList<int> *x = new LinkedList<int> ;
- LinkedList<int> *y = new LinkedList<int> ;
- (*x)->set_impl(LOCKED_DOUBLE) ;
- (*y)->set_impl(LOCKED_DOUBLE) ;
-
- // initialize
- for (int i = 0 ; i != 2 * BLK_SIZE; i++ )
- block[i] = i ;
-
- for (i = 0 ; i != BLK_SIZE; i++ )
- x->queue(&block[i]) ;
-
- for ( ; i != 2 * BLK_SIZE; i++ )
- y->queue(&block[i]) ;
-
- // merge x and y
- x->merge_lists(y) ;
-
- // get an iterator
- ListIterator<int> iter(x) ;
-
- for ( i = 0 ; i != 2 * BLK_SIZE ; i++ )
- sec_block[i] = *(x->remove_from_list(&block[i])) ;
-
- if (memcmp(sec_block, block, sizeof(block) ) == 0 )
- cerr << "COMPARED EQUAL" << endl ;
- else
- cerr << "DID NOT COMPARE EQUAL" << endl ;
-
- cerr << "Going to do Hash Table stuff " << endl ;
-
- HashTable<int,int,2 * BLK_SIZE> axb ;
- for ( i = 0 ; i != 2 * BLK_SIZE; i++ )
- block[i] = i*10 ;
-
- cerr << "Going to do Hash Table insert " << endl ;
-
- for ( i = 0 ; i != 2 * BLK_SIZE; i++ )
- axb[i] = block[i] ;
-
- cerr << "Going to do Hash Table find " << endl ;
-
- for ( i = 0 ; i != 2 * BLK_SIZE; i++ )
- sec_block[i] = axb[i] ;
-
- if (memcmp(sec_block, block, sizeof(block) ) == 0 )
- cerr << "COMPARED EQUAL" << endl ;
- else
- cerr << "DID NOT COMPARE EQUAL" << endl ;
-
- for ( i = 0 ; i != 2 * BLK_SIZE; i++ )
- axb.remove(i) ;
-
- cerr << "ALL DONE" << endl ;
-
- }
-